Optimal mutation probability for genetic algorithms
نویسندگان
چکیده
منابع مشابه
Rank-based Control of Mutation Probability for Genetic Algorithms
This paper proposes a rank-based control method of mutation probability for improving the performances of genetic algorithms (GAs). In order to improve the performances of GAs, GAs should not fall into premature convergence phenomena and should also be able to easily get out of the phenomena when GAs fall into the phenomena without destroying good individuals. For this, it is important to keep ...
متن کاملSelective Mutation for Genetic Algorithms
In this paper, we propose a selective mutation method for improving the performances of genetic algorithms. In selective mutation, individuals are first ranked and then additionally mutated one bit in a part of their strings which is selected corresponding to their ranks. This selective mutation helps genetic algorithms to fast approach the global optimum and to quickly escape local optima. Thi...
متن کاملError thresholds and optimal mutation rates in genetic algorithms
Declaration I hereby declare that this thesis has not been submitted, either in the same or different form, to this or any other university for a degree. Acknowledgements I am very grateful to my supervisors Hilary Buxton and Inman Harvey for their constant guidance and support. They followed the whole process very closely and suggested useful ideas and insights all the way long. The frequent a...
متن کاملOptimal Mutation Rates and Selection Pressure in Genetic Algorithms
It has been argued that optimal per-locus mutation rates in GAs are proportional to selection pressure and the reciprocal of genotype length. In this paper we suggest that the notion of error threshold, borrowed from molecular evolution, sheds new light on this argument. We show empirically the existence of error thresholds in GAs running on a simple abstract landscape; and then investigate a r...
متن کاملOptimal Sampling for Genetic Algorithms
In many real-world environments, a genetic algorithm designer is often faced with choosing the best tness function from a range of possibilities. Fitness functions diier primarily based upon the speed, accuracy, and cost of a tness evaluation. An important type of tness function is the sampling tness function, which utilizes sampling in order to reduce the noise of tness evaluations. The accura...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1995
ISSN: 0895-7177
DOI: 10.1016/0895-7177(95)00035-z